⟸ Go Back ⟸
Exercise 9 (Homework 5).
(RE (semi-decidable/ recursively enumerable languages))

Projection of \mathbf{RE}

Let A\in \mathbf{RE}. Show that \{x\mid \exists y\ \langle x,y\rangle\in A\}\in \mathbf{RE}\ .